public class demo1 {
    public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        int n=obstacleGrid[0].length;
        int m=obstacleGrid.length;
        int [][]arr=new int[m+1][n+1];
        arr[0][1]=1;
        for (int i=1;i<=m;i++){
            for (int j=1;j<=n;j++){
                if(obstacleGrid[i-1][j-1]==1){
                    arr[i][j]=0;
                }else{
                    arr[i][j]=arr[i-1][j]+arr[i][j-1];
                }
            }
        }
        return arr[m][n];
    }
}
